Vectorization is a technique that replaces a set-valued optimization problemwith a vector optimization problem. In this work, by using an extension ofGerstewitz function [1], a vectorizing function is defined to replace a givenset-valued optimization problem with respect to set less order relation. Someproperties of this function are studied. Also, relationships between aset-valued optimization problem and a vector optimization problem, derived viavectorization of this set-valued optimization problem, are examined.Furthermore, necessary and sufficient optimality conditions are presentedwithout any convexity assumption.
展开▼
